MolGrow: A Graph Normalizing Flow for Hierarchical Molecular Generation
نویسندگان
چکیده
We propose a hierarchical normalizing flow model for generating molecular graphs. The produces new structures from single-node graph by recursively splitting every node into two. All operations are invertible and can be used as plug-and-play modules. nature of the latent codes allows precise changes in resulting graph: perturbations first layer cause global structural changes, while consequent layers change molecule only marginally. Proposed outperforms existing generative models on distribution learning task. also show successful experiments constrained optimization chemical properties using model.
منابع مشابه
Hierarchical Reachability Graph Generation for Petri NetsPeter
Reachability analysis is the most general approach to analyze Petri nets. Due to state space explosion , generation of the reachability set and reachability graph becomes intractable even for moderately sized nets with the known approaches. This paper presents a new method to generate and represent the reachability set and reachability graph of large Petri nets in a compositional and hierarchic...
متن کاملHierarchical Reachability Graph Generation for Petri Nets
Reachability analysis is the most general approach to the analysis of Petri nets. Due to the wellknown problem of state-space explosion, generation of the reachability set and reachability graph with the known approaches often becomes intractable even for moderately sized nets. This paper presents a new method to generate and represent the reachability set and reachability graph of large Petri ...
متن کاملHierarchical Control Flow Graph Models
Hierarchical Control Flow Graph Models deene a modeling paradigm for discrete event simulation modeling based upon hierarchical extensions to Control Flow Graph Models. Conceptually, models consist of a set of encapsulated, concurrently operating model components that interact solely via message passing. The primary objectives of Hierarchical Control Flow Graph Models are: (1) to facilitate mod...
متن کاملHierarchical Reachability Graph Generation for Petri NetsPeter Buchholz
Reachability analysis is the most general approach to analyze Petri nets. Due to state space explosion , generation of the reachability set and reachability graph becomes intractable even for moderately sized nets with the known approaches. This paper presents a new method to generate and represent the reachability set and reachability graph of large Petri nets in a compositional and hierarchic...
متن کاملA Novel Molecular Descriptor Derived from Weighted Line Graph
The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i9.17001